WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(8)
  "activate" :: ["A"(0)] -(2)-> "A"(0)
  "afterNth" :: ["A"(8) x "A"(0)] -(3)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "fst" :: ["A"(0)] -(1)-> "A"(0)
  "head" :: ["A"(0)] -(1)-> "A"(0)
  "n__natsFrom" :: ["A"(0)] -(0)-> "A"(0)
  "natsFrom" :: ["A"(0)] -(1)-> "A"(0)
  "nil" :: [] -(0)-> "A"(0)
  "pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(8)] -(8)-> "A"(8)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "sel" :: ["A"(8) x "A"(0)] -(5)-> "A"(0)
  "snd" :: ["A"(0)] -(1)-> "A"(0)
  "splitAt" :: ["A"(8) x "A"(0)] -(1)-> "A"(0)
  "tail" :: ["A"(0)] -(3)-> "A"(0)
  "take" :: ["A"(8) x "A"(0)] -(3)-> "A"(0)
  "u" :: ["A"(0) x "A"(0) x "A"(0) x "A"(0)] -(3)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "activate" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "n__natsFrom" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "natsFrom" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "nil" :: [] -(0)-> "A"_cf(0)
  "pair" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "splitAt" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "u" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------